منابع مشابه
On properties of bond-free DNA languages
The input data for DNA computing must be encoded into the form of single or double DNA strands. As complementary parts of single strands can bind together forming a double-stranded DNA sequence, one has to impose restrictions on these sets of DNA words (languages) to prevent them from interacting in undesirable ways. We recall a list of known properties of DNA languages which are free of certai...
متن کاملCoding Properties of DNA Languages
The computation language of a DNA-based system consists of all the words (DNA strands) that can appear in any computation step of the system. In this work we define properties of languages which ensure that the words of such languages will not form undesirable bonds when used in DNA computations. We give several characterizations of the desired properties and provide methods for obtaining langu...
متن کاملIntercalation properties of context-free languages
Boonyavatana, Rattikorn, "Intercalation properties of context-free languages " (1986). Retrospective Theses and Dissertations. Paper 8142. While the most advanced technology has been used to photograph and reproduce this manuscript, the quality of the reproduction is heavily dependent upon the quality of the material submitted. For example: • Manuscript pages may have indistinct print. In such ...
متن کاملTopological properties of omega context-free languages
This paper is a study of topological properties of omega context free languages (ω-CFL). We first extend some decidability results for the deterministic ones (ωDCFL), proving that one can decide whether an ω-DCFL is in a given Borel class, or in the Wadge class of a given ω-regular language . We prove that ω-CFL exhaust the hierarchy of Borel sets of finite rank, and that one cannot decide the ...
متن کاملBond-Free Languages: Formalizations, Maximality and Construction Methods
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA computations. We recall a few existing formalizations of the problem and then define the property of sim-bond-freedom, where sim is a similarity relation between words. We show that this property is decidable for context-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.12.032